Syllogistic Logics with Verbs

نویسنده

  • Lawrence S. Moss
چکیده

This paper provides sound and complete logical systems for several fragments of English which go beyond syllogistic logic in that they use verbs as well as other limited syntactic material: universally and existentially quantified noun phrases, building on the work of Nishihara, Morita, and Iwata [7]; complemented noun phrases, following our [6]; and noun phrases which might contain relative clauses, recursively, based on McAllester and Givan [4]. The logics are all syllogistic in the sense that they do not make use of individual variables. Variables in our systems range over nouns, and in the last system, over verbs as well.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On the Complexity of the Numerically Definite Syllogistic and Related Fragments

In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of some recently proposed proof-systems for these logics.

متن کامل

Logics for the Relational Syllogistic

The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a) whether negation is permitted on all nouns, including those in the subject of a sentence; and (b) whether the subject noun phrase may contain a relative clause...

متن کامل

Syllogistic Logic with Comparative Adjectives

This paper adds comparative adjectives to the known systems of syllogistic logic. The comparatives are interpreted by transitive and irreflexive relations. The main point is to obtain sound and complete axiomatizations of the logics.

متن کامل

Arithmetizations of Syllogistic à la Leibniz

à Lukasiewicz had every reason to suppose that Leibniz’s winged Calculemus! had been connected with the Aristotelian syllogistic [4, § 34]. Indeed, after Louis Couturat’s pioneer efforts in commenting and publishing Leibniz’s logical opuscula ([1], [2]). The basic idea of the arithmetization of syllogistic was to establish a correspondence between terms and suitable integers (the characteristic...

متن کامل

The probability heuristics model of syllogistic reasoning.

A probability heuristic model (PHM) for syllogistic reasoning is proposed. An informational ordering over quantified statements suggests simple probability based heuristics for syllogistic reasoning. The most important is the "min-heuristic": choose the type of the least informative premise as the type of the conclusion. The rationality of this heuristic is confirmed by an analysis of the proba...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Log. Comput.

دوره 20  شماره 

صفحات  -

تاریخ انتشار 2010